The Generalized Maximum Coverage Problem
نویسندگان
چکیده
We define a new problem called the Generalized Maximum Coverage Problem (GMC). GMC is an extension of the Budgeted Maximum Coverage Problem, and it has important applications in wireless OFDMA scheduling. We use a variation of the greedy algorithm to produce a ( 2e−1 e−1 + )-approximation for every > 0, and then use partial enumeration to reduce the approximation ratio to e e−1 + .
منابع مشابه
Exact maximum coverage probabilities of confidence intervals with increasing bounds for Poisson distribution mean
A Poisson distribution is well used as a standard model for analyzing count data. So the Poisson distribution parameter estimation is widely applied in practice. Providing accurate confidence intervals for the discrete distribution parameters is very difficult. So far, many asymptotic confidence intervals for the mean of Poisson distribution is provided. It is known that the coverag...
متن کاملBootstrap confidence intervals of CNpk for type‑II generalized log‑logistic distribution
This paper deals with construction of confidence intervals for process capability index using bootstrap method (proposed by Chen and Pearn in Qual Reliab Eng Int 13(6):355–360, 1997) by applying simulation technique. It is assumed that the quality characteristic follows type-II generalized log-logistic distribution introduced by Rosaiah et al. in Int J Agric Stat Sci 4(2):283–292, (2008). Discu...
متن کاملComparing Mean Vectors Via Generalized Inference in Multivariate Log-Normal Distributions
Abstract In this paper, we consider the problem of means in several multivariate log-normal distributions and propose a useful method called as generalized variable method. Simulation studies show that suggested method has a appropriate size and power regardless sample size. To evaluation this method, we compare this method with traditional MANOVA such that the actual sizes of the two methods ...
متن کاملImproved Approximations for Non-monotone Submodular Maximization with Knapsack Constraints
Submodular maximization generalizes many fundamental problems in discrete optimization,including Max-Cut in directed/undirected graphs, maximum coverage, maximum facility loca-tion and marketing over social networks.In this paper we consider the problem of maximizing any submodular function subject to dknapsack constraints, where d is a fixed constant. We establish a strong ...
متن کاملCoverage Optimization using Generalized Voronoi Partition
In this paper we use a generalization of the Voronoi partition to formulate and solve a heterogeneous distributed locational optimization problem for autonomous agents having limited range sensors. Agents equipped with sensors having heterogeneity in their capabilities, communication equipment, and computational capability are to be optimally deployed in a domain of interest. The optimal deploy...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Inf. Process. Lett.
دوره 108 شماره
صفحات -
تاریخ انتشار 2008